A Low Complexity 2D Pattern Synthesis Algorithm for Cylindrical Array
نویسندگان
چکیده
منابع مشابه
A Low-Complexity Nyström-Based Algorithm for Array Subspace Estimation
Subspace-based methods rely on singular value decomposition (SVD) of the sample covariance matrix (SCM) to compute the array signal or noise subspace. For large array, triditional subspace-based algorithms inevitably lead to intensive computational complexity due to both calculating SCM and performing SVD of SCM. To circumvent this problem, a NyströmBased algorithm for array subspace estimation...
متن کاملPattern Synthesis using Genetic Algorithm for Low Sidelobe Levels
For pattern synthesis of arrays, it is required to find out appropriate weighting vectors to yield a desired radiation pattern. It is well known that several methods for above purpose are available in literature. It is an established fact that when an attempt is made to reduce the first sidelobe level, the beamwidth increases. However, it is of interest in the present work to synthesize an arra...
متن کاملON FUZZY NEIGHBORHOOD BASED CLUSTERING ALGORITHM WITH LOW COMPLEXITY
The main purpose of this paper is to achieve improvement in thespeed of Fuzzy Joint Points (FJP) algorithm. Since FJP approach is a basisfor fuzzy neighborhood based clustering algorithms such as Noise-Robust FJP(NRFJP) and Fuzzy Neighborhood DBSCAN (FN-DBSCAN), improving FJPalgorithm would an important achievement in terms of these FJP-based meth-ods. Although FJP has many advantages such as r...
متن کاملArray Pattern Control and Synthesis
Antenna array distributions and their associated patterns are now designed on physical principles, based on placement of zeros of the array polynomial. An overview of the synthesis processes is given. Robust and low Q distributions for linear arrays and circular planar arrays, that provide variable side lobe level pencil beam patterns, are treated in detail. Associated difference patterns are i...
متن کاملLow Complexity and High speed in Leading DCD ERLS Algorithm
Adaptive algorithms lead to adjust the system coefficients based on the measured data. This paper presents a dichotomous coordinate descent method to reduce the computational complexity and to improve the tracking ability based on the variable forgetting factor when there are a lot of changes in the system. Vedic mathematics is used to implement the multiplier and the divider in the VFF equatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Antennas and Propagation
سال: 2013
ISSN: 1687-5869,1687-5877
DOI: 10.1155/2013/352843